Rational Closure in SHIQ
نویسندگان
چکیده
We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [24]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal models. We show that the rational closure of a TBox can be computed in EXPTIME using entailment in SHIQ.
منابع مشابه
Minimal models for rational closure in SHIQ
We introduce a notion of rational closure for the logic SHIQ based on the well-known rational closure by Lehmann and Magidor [21]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal models.
متن کاملA Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. It was proved that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. We have identi...
متن کاملA Tableaux-based Algorithm for Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. We start by proving that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. An analy...
متن کاملOn the maximal ideal space of extended polynomial and rational uniform algebras
Let K and X be compact plane sets such that K X. Let P(K)be the uniform closure of polynomials on K. Let R(K) be the closure of rationalfunctions K with poles o K. Dene P(X;K) and R(X;K) to be the uniformalgebras of functions in C(X) whose restriction to K belongs to P(K) and R(K),respectively. Let CZ(X;K) be the Banach algebra of functions f in C(X) suchthat fjK = 0. In this paper, we show th...
متن کاملICTCS ’ 14 Fifteenth Italian Conference on
argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making Stefano Bistarelli, Martine Ceberio, Joel A. Henderson, Francesco Santini 247 Optimal placement of storage nodes in a wireless sensor network Gianlorenzo D’Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti 259 Engineering shortest-path algorithms for dynamic networks Mattia D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014